Application of Linguistic Rules to Generalized Example Based Machine Translation for Indian Languages
نویسندگان
چکیده
This paper shows how certain perceptible linguistic rules help in the process of making Machine Translation simpler and computationally inexpensive when translating from English to a class of Indian Languages. The paper explains the method in detail for Kannada (Language spoken in Karnataka) and can be extended to other Indian Languages. A combination of a simple Generalized Example Based Machine Translation (G-EBMT) system and these linguistic rules gave a score of 0.7164 using the BLEU evaluation metric on a set of 100 sentences while translating sentences from English to Kannada.
منابع مشابه
A Hybrid Approach to Example based Machine Translation for Indian Languages
Corpus based approaches to machine translation namely Example based machine translation and Statistical machine translation have received wide focus in the recent years. Hybrid approaches combining the two further improved the performance. Indian language machine translation has mostly focussed on rule based machine translation. We propose a hybrid approach to Example based machine translation ...
متن کاملA Hybrid Approach Using Phrases and Rules for Hindi to English Machine Translation
The present work focuses on developing a hybrid approach for developing a machine translation (MT) scheme for automatic translation of Hindi sentences to English. Development of machine translation (MT) systems for Indian languages to English almost invariably suffers from the limited availability of linguistic resources. As a consequence, statistical, rule-based or example-based approaches hav...
متن کاملA Hybrid Machine Translation System Based on a Monotone Decoder
In this paper, a hybrid Machine Translation (MT) system is proposed by combining the result of a rule-based machine translation (RBMT) system with a statistical approach. The RBMT uses a set of linguistic rules for translation, which leads to better translation results in terms of word ordering and syntactic structure. On the other hand, SMT works better in lexical choice. Therefore, in our sys...
متن کاملSupertag Based Pre-ordering in Machine Translation
This paper presents a novel approach to integrate mildly context sensitive grammar in the context of pre-ordering for machine translation. We discuss the linguistic insights available in this grammar formalism and use it to develop a pre-ordering system. We show that mildly context sensitive grammar proves to be beneficial over context free grammar, which facilitates better reordering rules. Fo...
متن کاملICON - 2008 6 th International Conference on Natural Language Processing
A system of machine translation under the framework of transfer-based grammar for Indian languages needs a set of rules for mapping the several syntactic as well as semantic facts of a source language on to the target language representations. Among these critical syntactico-semantic facts, this paper tries to approximate linguistic conditions for mapping rules for Hindi postposition transfer t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006